#include <iostream>
#include <queue>
#include <cstring>

using namespace std;

typedef pair<int, int> PII;

const int N = 1010;
char a[N][N];
int dist[N][N];
int n, m;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};

void bfs()
{
	memset(dist, -1, sizeof dist);
	queue<PII> q;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= m; j++)
		{
			if(a[i][j] == '1')
			{
				q.push({i, j});
				dist[i][j] = 0;
			} 
		}
	}
	while(q.size())
	{
		auto t = q.front(); q.pop(); 
		int x = t.first;
		int y = t.second;
		for(int k = 0; k < 4; k++)
		{
			int i = x + dx[k];
			int j = y + dy[k];
			if(dist[i][j] == -1 && i >= 1 && j >= 1 && i <= n && j <= m)
			{
				dist[i][j] = dist[x][y] + 1;
				q.push({i, j});
			}
		
		}
	
	}
}

int main()
{
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= m; j++)
			cin >> a[i][j];
		
	bfs();
	
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= m; j++)
		{
			cout << dist[i][j] << " ";
		}
		cout << endl;
	}
	return 0;
}
